DINCast: a hop efficient dynamic multicast infrastructure for P2P computing

Efficient communications among computers participating in Peer-to-Peer (P2P) computing remains a problem when they are geographically distributed across multiple network domains. In this paper, we propose DINCast to support group communications required in P2P computing. DINCast is built on top of an existing P2P multicast tree and results in a hop efficient dynamic multicast infrastructure. We show that DINCast is able to reduce communications delay compared with the original tree-based multicast. DINCast is also advantageous since it can achieve load balance and data persistency. Keywords— DINCast, tree-based multicast, DIN-Loop, hop count, peer-to-peer computing